BNC-PSO: structure learning of Bayesian networks by Particle Swarm Optimization

Structure learning is a very important problem in the field of Bayesian networks (BNs). It is also an active research area for more than two decades; therefore, many approaches have been proposed in order to find an optimal structure based on training samples. In this paper, a Particle Swarm Optimization (PSO)-based algorithm is proposed to solve the BN structure learning problem; named BNC-PSO (Bayesian Network Construction algorithm using PSO). Edge inserting/deleting is employed in the algorithm to make the particles have the ability to achieve the optimal solution, while a cycle removing procedure is used to prevent the generation of invalid solutions. Then, the theorem of Markov chain is used to prove the global convergence of our proposed algorithm. Finally, some experiments are designed to evaluate the performance of the proposed PSO-based algorithm. Experimental results indicate that BNC-PSO is worthy of being studied in the field of BNs construction. Meanwhile, it can significantly increase nearly 15% in the scoring metric values, comparing with other optimization-based algorithms. BNC‐PSO: Structure Learning of Bayesian Networks by Particle Swarm Optimization S. Gheisari M.R. Meybodi Department of Computer, Science and Research Branch, Islamic Azad University, Tehran, Iran. Computer Engineering and Information Technology Department, Amirkabir University of Technology, Tehran, Iran. [email protected] [email protected] Abstract Structure learning is a very important problem in the field of Bayesian networks (BNs). It is also an active research area for more than two decades; therefore, many approaches have been proposed in order to find an optimal structure based on training samples. In this paper, a Particle Swarm Optimization (PSO)-based algorithm is proposed to solve the BN structure learning problem; named BNC-PSO (Bayesian Network Construction algorithm using PSO). Edge inserting/deleting is employed in the algorithm to make the particles have the ability to achieve the optimal solution, while a cycle removing procedure is used to prevent the generation of invalid solutions. Then, the theorem of Markov chain is used to prove the global convergence of our proposed algorithm. Finally, some experiments are designed to evaluate the performance of the proposed PSO-based algorithm. Experimental results indicate that BNC-PSO is worthy of being studied in the field of BNs construction. Meanwhile, it can significantly increase nearly 15% in the scoring metric values, comparing with other optimization-based algorithms.